An Improved Heuristic for Consistent Biclustering Problems

نویسندگان

  • Artyom Nahapetyan
  • Stanislav Busygin
  • Panos Pardalos
چکیده

Let matrix A represent a data set of m features and n samples. Each element of the matrix, aij , corresponds to the expression of the i-th feature in the j-th sample. Biclustering is a classification of the samples as well as features into k classes. In other words, we need to classify columns and rows of the matrix A. Doing so, let S1, S2, . . . , Sk and F1, F2, . . . , Fk denote the classes of the samples (columns) and features (rows), respectively. Formally biclustering can be defined as follows.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Extending the definition of beta-consistent biclustering for feature selection

Consistent biclusterings of sets of data are useful for solving feature selection and classification problems. The problem of finding a consistent biclustering can be formulated as a combinatorial optimization problem, and it can be solved by the employment of a recently proposed VNS-based heuristic. In this context, the concept of β-consistent biclustering has been introduced for dealing with ...

متن کامل

A New Heuristic for Feature Selection by Consistent Biclustering

Given a set of data, biclustering aims at finding simultaneous partitions in biclusters of its samples and of the features which are used for representing the samples. Consistent biclusterings allow to obtain correct classifications of the samples from the known classification of the features, and vice versa, and they are very useful for performing supervised classifications. The problem of fin...

متن کامل

Improved Cuckoo Search Algorithm for Global Optimization

The cuckoo search algorithm is a recently developedmeta-heuristic optimization algorithm, which is suitable forsolving optimization problems. To enhance the accuracy andconvergence rate of this algorithm, an improved cuckoo searchalgorithm is proposed in this paper. Normally, the parametersof the cuckoo search are kept constant. This may lead todecreasing the efficiency of the algorithm. To cop...

متن کامل

Biclustering of Gene Expression Using Glowworm Swarm Optimization and Neuro-Fuzzy Discriminant Analysis

-The advent of DNA microarray technologies has revolutionized the experimental study of gene expression. Biclustering is the most popular approach of analyzing gene expression data and has indeed proven to be successful in many applications. In recent years, several biclustering methods have been suggested to identify local patterns in gene expression data. Most of these algorithms represent gr...

متن کامل

‎A Consistent and Accurate Numerical Method for Approximate Numerical Solution of Two Point Boundary Value Problems

In this article we have proposed an accurate finite difference method for approximate numerical solution of second order boundary value problem with Dirichlet boundary conditions. There are numerous numerical methods for solving these boundary value problems. Some these methods are more efficient and accurate than others with some advantages and disadvantages. The results in experiment on model...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006